Optimal rate-based scheduling on multiprocessors
نویسندگان
چکیده
منابع مشابه
Rate-Monotonic Scheduling on Uniform Multiprocessors
The rate-monotonic algorithm is arguably one of the most popular algorithms for scheduling systems of periodic real-time tasks. The rate-monotonic scheduling of systems of periodic tasks on uniform multiprocessor platforms is considered here. A simple, sufficient test is presented for determining whether a given periodic task system will be successfully scheduled by this algorithm upon a partic...
متن کاملOptimal Co-Scheduling to Minimize Makespan on Chip Multiprocessors
On-chip resource sharing among sibling cores causes resource contention on Chip Multiprocessors (CMP), considerably degrading program performance and system fairness. Job co-scheduling attempts to alleviate the problem by assigning jobs to cores intelligently. Despite many heuristics-based empirical explorations, studies on optimal co-scheduling and its inherent complexity start only recently, ...
متن کاملPartitioned Aperiodic Scheduling on Multiprocessors
This paper studies multiprocessor scheduling for aperiodic tasks where future arrivals are unknown. We propose an algorithm for tasks without migration capabilities and prove that it has a capacity bound of 0:31. No algorithm for tasks without migration capabilities can have a capacity bound greater than 0:50.
متن کاملStatic-priority Scheduling on Multiprocessors
This thesis deals with the problem of scheduling a set of tasks to meet deadlines on a computer with multiple processors. Static-priority scheduling is considered, that is, a task is assigned a priority number that never changes and at every moment the highestpriority tasks that request to be executed are selected for execution. The performance metric used is the capacity that tasks can request...
متن کاملEecient Resource Scheduling in Multiprocessors Eecient Resource Scheduling in Multiprocessors Abstract Eecient Resource Scheduling in Multiprocessors
E cient Resource Scheduling in Multiprocessors by Soumen Chakrabarti Doctor of Philosophy in Computer Science University of California at BERKELEY Professor Katherine Yelick, Computer Science, Chair As multiprocessing becomes increasingly successful in scienti c and commercial computing, parallel systems will be subjected to increasingly complex and challenging workloads. To ensure good job res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2006
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2006.03.001